Backward Beam Search Algorithm for Dependency Analysis of Japanese
نویسندگان
چکیده
Backward beam search for dependency analysis of Japanese is proposed. As dependencies normally go from left to right in Japanese, it is effective to analyze sentences backwards (from right to left). The analysis is based on a statistical method and employs a beam search strategy. Based on experiments varying the beam search width, we found that the accuracy is not sensitive to the beam width and even the analysis with a beam width of 1 gets almost the same dependency accuracy as the best accuracy using a wider beam width. This suggested a deterministic algorithm for backwards Japanese dependency analysis, although still the beam search is effective as the N-best sentence accuracy is quite high. The time of analysis is observed to be quadratic in the sentence length.
منابع مشابه
Semantic Dependency Analysis Method for Japanese based on Optimum Tree Search Algorithm
There is combinatorial order of ambiguities in each level of natural language analysis, such as the morphology, syntax, and semantic levels. Moreover, much of the linguistic knowledge in each level is preference knowledge and has mutual interference. Deterministic processing is usually introduced to avoid the combinatorial explosion. However, this restricts the ability of natural language proce...
متن کاملReverse Island Effects and the Backward Search for a Licensor in Multiple WhQuestions
This paper reports a series of formal acceptability-judgment experiments designed to investigate the syntactic properties of a relatively understudied type of wh-dependency: multiple wh-questions in English. By using a factorial definition of island effects made available only by formal experiments, we report an unpredicted pattern of acceptability that suggests the existence of reverse island ...
متن کاملIterative Approach for Automatic Beam Angle Selection in Intensity Modulated Radiation Therapy Planning
Introduction: Beam-angle optimization (BAO) is a computationally intensive problem for a number of reasons. First, the search space of the solutions is huge, requiring enumeration of all possible beam orientation combinations. For example, when choosing 4 angles out of 36 candidate beam angles, C36 = 58905 possible combinations exist. Second, any change in a beam 4 config...
متن کاملBackward Viterbi beam search for utilizing dynamic task complexity information
The backward Viterbi beam search has not received enough attentions other than being used in the second pass. The reason is that the speech recognition society has long ignored the concept of dynamic complexities of a speech recognition task which can help us to determine whether we should operate Viterbi decoding in forward or backward direction. We use the U.S. street address entry task as on...
متن کاملNon-Recursive Beam Search on GPU for Formal Concept Analysis
We document a parallel non-recursive beam search GPGPU FCA algorithm written in nVidia CUDA C. We run it on benchmarks and to analyse software module dependency. Despite kernel sort removing repeated calculations, 32 bit packing and optimising GPU data structures and kernels, we do not yet see major speed ups. Instead GeForce 295 GTX and Tesla C2050 report 141 072 concepts (maximal rectangles, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000